Big cells and LU factorization in reductive monoids
نویسندگان
چکیده
منابع مشابه
Shellability in Reductive Monoids
The purpose of this paper is to extend to monoids the work of Björner, Wachs and Proctor on the shellability of the Bruhat-Chevalley order on Weyl groups. Let M be a reductive monoid with unit group G, Borel subgroup B and Weyl group W . We study the partially ordered set of B×Borbits (with respect to Zariski closure inclusion) within a G × G-orbit of M . This is the same as studying a W ×W -or...
متن کاملFactorization in Topological Monoids
We sketch a theory of divisibility and factorization in topological monoids, where finite products are replaced by convergent products. The algebraic case can then be viewed as the special case of discretely topologized topological monoids. We define the topological factorization monoid, a generalization of the factorization monoid for algebraic monoids, and show that it is always topologically...
متن کاملUnique Factorization Monoids and Domains
It is the purpose of this paper to construct unique factorization (uf) monoids and domains. The principal results are: (1) The free product of a well-ordered set of monoids is a uf-monoid iff every monoid in the set is a uf-monoid. (2) If M is an ordered monoid and F is a field, the ring ^[[iW"]] of all formal power series with well-ordered support is a uf-domain iff M is naturally ordered (i.e...
متن کاملParallelizing LU Factorization
Systems of linear equations can be represented by matrix equations of the form A~x = ~b. LU Factorization is a method for solving systems in this form by transforming the matrix A into a form that makes backwards and forward susbstitution feasible. A common algorithm for LU factorization is Gaussian elimination, which I used for my serial and parallel implementations. I investigated using async...
متن کاملBlock LU Factorization
Many of the currently popular \block algorithms" are scalar algorithms in which the operations have been grouped and reordered into matrix operations. One genuine block algorithm in practical use is block LU factorization, and this has recently been shown by Demmel and Higham to be unstable in general. It is shown here that block LU factorization is stable if A is block diagonally dominant by c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2002
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-02-06515-2